Path Constraints from a Modal Logic Point of View
نویسندگان
چکیده
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding them in Propositional Dynamic Logic. While some of our decidability results were known before, we believe that our improved complexity bounds are new. Our proofs, based on techniques from modal logic, shed additional light on the reasons for previously known decidability and complexity results.
منابع مشابه
A Modal Perspective on Path Constraints
Several classes of path constraints for semistructured data are analysed and a number of decidability and complexity results proved for such constraints. While some of these decidability results were known before, it is believed that the improved complexity bounds are new. Proofs are based on techniques from modal logic and automata theory. This modal logic perspective sheds additional light on...
متن کاملExpressiveness of Positive Coalgebraic Logic
From the point of view of modal logic, coalgebraic logic over posets is the natural coalgebraic generalisation of positive modal logic. From the point of view of coalgebra, posets arise if one is interested in simulations as opposed to bisimulations. From a categorical point of view, one moves from ordinary categories to enriched categories. We show that the basic setup of coalgebraic logic ext...
متن کاملThe General Multimodal Network Equilibrium Problem with Elastic Balanced Demand
The general multimodal network equilibrium problem with elastic balanced demand is studied. This problem is a combination of trip distribution, modal split and trip assignment problems. The problem is approached from an asymmetric network equilibrium point of view with side constraints. The balances for travel demand are taken as side constraints. These balances do not guarantee that the proble...
متن کاملModal Provability Foundations for Negation by Failure
This paper is a contribution to the foundation of negation by failure. It presents a view of negation by failure as a modal provability notion. Negation by failure is a central notion in Logic Programming and is used extensively in practice. There are various attempts at its foundations each with its own difficulties and limitations. We would like to present the modal point of view which, as fa...
متن کاملA note on Brute vs. Institutional Facts: Modal Logic of Equivalence Up To a Signature
The paper investigates the famous Searlean distinction between “brute” and “institutional” concepts from a logical point of view. We show how the partitioning of the non-logical alphabet—e.g., into “brute” and “institutional” atoms—gives rise to interesting modal properties. A modal logic, called UpTo-logic, is introduced and investigated which formalizes the notion of (propositional) logical e...
متن کامل